Towards Provably Secure Eecient Electronic Cash (extended Abstract)

نویسنده

  • Matthew Franklin
چکیده

An \electronic coin scheme" as deened by Chaum, Fiat, and Naor 5] is a collection of protocols to achieve untraceable, unforgeable coins with ooine purchasing; this is the minimum set of properties to make electronic money useful. We give a new electronic coin scheme that is simple and practical. Withdrawal requires only two rounds of interaction, while purchase and deposit are non-interactive; all previous eecient cash schemes require interaction (cut-and-choose) for purchases. Moreover, messages during purchase and deposit contain only a few encrypted values, independent of the tolerable probability of cheating. We present a security model for electronic coins, and prove the security of our scheme relative to certain speciic cryptographic assumptions (hardness of Discrete Log and possibility of secure blind signature).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fair Oo-line E-cash Made Easy

The major considerations in designing a secure system are (1) simplicity of the algorithms involved, (2) eeciency of the implementation, and (3) provable security; these attributes contribute to the \elegance" of a system, easing its implementation (and limiting the possibility of errors) and the burden on system resources. Anonymous oo-line electronic cash (e-cash) systems provide transactions...

متن کامل

Provably Secure Blind Signature Schemes

In this paper, we give a provably secure design for blind signatures, the most important ingredient for anonymity in off-line electronic cash systems. Previous examples of blind signature schemes were constructed from traditional signature schemes with only the additional proof of blindness. The design of some of the underlying signature schemes can be validated by a proof in the so-called rand...

متن کامل

Provably Secure Untraceable Electronic Cash against Insider Attacks

Although a great deal of research has been done on electronic cash schemes with blind multisignatures to prevent an insider attack, there is no discussion of a formal security model in the literature. Firstly we discussed the security model of e-cash schemes based on the blind multisignature scheme against a (restricted) attack model and proposed a concrete scheme proven to be secure in the mod...

متن کامل

A Novel ID-based Electronic Cash System from Pairings

Abstract Recently, Chen et al. and Juang et al. each proposed one and two e-cash payment systems respectively. They claimed that their schemes are secure. However, in this paper, we will present the shortcomings of their schemes and then propose a novel one from pairings. After security analysis and comparison, we conclude that our scheme not only is more secure but also possesses more function...

متن کامل

Artemia: a family of provably secure authenticated encryption schemes

Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992